#include "Adjacency.h"
#include "Queue.h"

void test1(AMGraph& graph)
{
	using namespace std;
	for (int i = 0; i < graph.vexnum; i++)
	{
		for (int j = 0; j < graph.vexnum; j++)
		{
			cout << graph.martix[i][j] << ' ';
		}
		cout << endl;
	}
	DFS(graph);
	cout << endl;
	BFS(graph);
}

int main()
{
	AMGraph graph;
	CreateGraph(graph);
	test1(graph);

	return 0;
}